solve_least_squares Interface

On input, the M-by-N matrix $A$. On output, if M is greater than or equal to N, the QR factorization of $A$ in the form provided by qr_factor; else, if M is less than N, the LQ factorization of $A$ as returned by lq_factor.

If the system is overdetermined, the M-by-NRHS matrix $B$; else, the matrix should be sized as N-by-NRHS with the first M rows containing $B$. On output, the first N rows will contain the solution matrix $X$.

An optional input, that if provided, prevents any local memory allocation. If not provided, the memory required is allocated within. If provided, the length of the array must be at least olwork.

An optional output used to determine workspace size. If supplied, the routine determines the optimal size for work, and returns without performing any actual calculations.

The error object to be updated.

On input, the M-by-N matrix $A$. On output, if M is greater than or equal to N, the QR factorization of $A$ in the form provided by qr_factor; else, if M is less than N, the LQ factorization of $A$ as returned by lq_factor.

If the system is overdetermined, the M-by-NRHS matrix $B$; else, the matrix should be sized as N-by-NRHS with the first M rows containing $B$. On output, the first N rows will contain the solution matrix $X$.

An optional input, that if provided, prevents any local memory allocation. If not provided, the memory required is allocated within. If provided, the length of the array must be at least olwork.

An optional output used to determine workspace size. If supplied, the routine determines the optimal size for work, and returns without performing any actual calculations.

The error object to be updated.

On input, the M-by-N matrix $A$. On output, if M is greater than or equal to N, the QR factorization of $A$ in the form provided by qr_factor; else, if M is less than N, the LQ factorization of $A$ as returned by lq_factor.

If the system is overdetermined, the M-element vector $\vec{b}$; else, the array should be sized as N-element with the first M elements containing $\vec{b}$. On output, the first N rows will contain the solution vector $\vec{x}$.

An optional input, that if provided, prevents any local memory allocation. If not provided, the memory required is allocated within. If provided, the length of the array must be at least olwork.

An optional output used to determine workspace size. If supplied, the routine determines the optimal size for work, and returns without performing any actual calculations.

The error object to be updated.

On input, the M-by-N matrix $A$. On output, if M is greater than or equal to N, the QR factorization of $A$ in the form provided by qr_factor; else, if M is less than N, the LQ factorization of $A$ as returned by lq_factor.

If the system is overdetermined, the M-element vector $\vec{b}$; else, the array should be sized as N-element with the first M elements containing $\vec{b}$. On output, the first N rows will contain the solution vector $\vec{x}$.

An optional input, that if provided, prevents any local memory allocation. If not provided, the memory required is allocated within. If provided, the length of the array must be at least olwork.

An optional output used to determine workspace size. If supplied, the routine determines the optimal size for work, and returns without performing any actual calculations.

The error object to be updated.